Rule-based transformation of graph rewriting rules: Towards higher-order graph grammars

Higher-order port-graph rewriting

The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we add higher-order features to the original port-graph syntax, along with a generalised notion of graph morphism. We provide a matching algorith...

Generating Preconditions from Graph Constraints by Higher Order Graph Transformation

Techniques for the verification of structural invariants in graph transformation systems typically rely on the derivation of negative application conditions that are attached to graph transformation rules in order to avoid the runtime occurrence of forbidden structural patterns in the system model. In this paper, we propose a practical approach for this derivation process, which produces the re...

Durative Graph Transformation Rules

Note on Node-Rewriting Graph Grammars

In various fields of computer science one has to manipulate complex data objects which have graph representations. Hence the study of ‘constructive’ graph processing mechanisms turns out to be of great importance. The theory of graph grammars can be seen as a part of such a study. In this note we discuss the relationship of two lines of development within the theory of graph grammars: the ‘Berl...

Graph grammars with string-regulated rewriting

Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression,...